Visualizing Weights

Sankey Arcs - Visualizing edge weights in path graphs

Arc diagrams allow exploring relations and their strength between sequential nodes. Previous solutions suffer from displaying all arcs at the center of a node, which can lead to visual obstruction. We present a new technique, which extends the arc diagram technique by laying out the weighted edges of a node adjacent to each other. The aim of our Sankey Arc technique is to improve clarity, to en...

Visualizing Dynamic Quantitative Data in Hierarchies - TimeEdgeTrees: Attaching Dynamic Weights to Tree Edges

In this paper we introduce a technique for visualizing the dynamics of quantitative data in static hierarchical structures. We exploit the straight links of orthogonal tree diagrams as a timeline on which we visually encode dynamic quantitative information. We use color coding and varying thicknesses to represent the time-varying data. Bimodal data can also be displayed by exploiting both sides...

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

Multiplicative Weights

In this lecture, we will study various applications of the theory of Multiplicative Weights (MW). In this section, we briefly review the general version of the MW algorithm that we studied in the previous lecture. The following sections then show how the theory can be applied to approximately solve zero-sum games and linear programs, and how it connects with the theory of boosting and approxima...

Minoan weights